A categorisation of nurse rostering problems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Categorisation of nurse rostering problems

Personnel rostering has received ample attention in recent years. Due to its social and economic relevance and due to its intrinsic complexity, it has become a major subject for scheduling and timetabling researchers. Among the personnel rostering problems, nurse rostering turned out to be particularly complex and difficult. In this paper, we propose a notation for nurse rostering problems alon...

متن کامل

Nurse rostering problems - a bibliographic survey

Hospitals need to repeatedly produce duty rosters for its nursing staff. The good scheduling of nurses has impact on the quality of health care, the recruitment of nurses, the development of budgets and other nursing functions. The nurse rostering problem (NRP) has been the subject of much study. This paper presents a brief overview, in the form of a bibliographic survey, of the many models and...

متن کامل

Comparison of Algorithms for Nurse Rostering Problems

Despite decades of research into automated methods for nurse rostering and some academic successes, one may notice that there is no consistency in the knowledge that has been built up over the years and that many healthcare institutions still resort to manual practices. One of the possible reasons for this gap between the nurse rostering theory and practice is that often the academic community ...

متن کامل

Variable Neighbourhood Search for Nurse Rostering Problems

Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...

متن کامل

Polynomially solvable formulations for a class of nurse rostering problems

Identifying underlying structures in combinatorial optimisation problems leads to a better understanding of a problem and, consequently, to efficient solution methodologies. The present paper introduces a new network flow formulation for a large class of nurse rostering problems. By solving an integer minimum cost flow problem in a carefully constructed network, nurses’ shift schedules can be c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2010

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-010-0211-z